0.00/0.02	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.07	% Command  : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 180 -p  --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
0.14/0.39	% Computer : n025.cluster.edu
0.14/0.39	% Model    : x86_64 x86_64
0.14/0.39	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.14/0.39	% Memory   : 8046.5625MB
0.14/0.39	% OS       : Linux 6.8.0-71-generic
0.14/0.39	% CPULimit : 1440
0.14/0.39	% WCLimit  : 180
0.14/0.39	% DateTime : Mon Jul 27 10:43:43 UTC 2026
0.14/0.40	% CPUTime  : 
0.14/0.40	Running java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 180 -p  --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
0.85/0.97	% [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
1.25/1.16	% [INFO] 	 Parsing done (186ms). 
1.25/1.17	% [INFO] 	 Running in sequential loop mode. 
1.81/1.59	% [INFO] 	 eprover registered as external prover. 
1.81/1.60	% [INFO] 	 Scanning for conjecture ... 
2.19/1.70	% [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
2.19/1.73	% [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
2.19/1.74	% [INFO] 	 Problem is higher-order (TPTP THF). 
2.19/1.74	% [INFO] 	 Type checking passed. 
2.19/1.74	% [CONFIG] 	 Using configuration: timeout(180) with strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>.  Searching for refutation ... 
11.99/3.95	% External prover 'e' found a proof!
11.99/3.95	% [INFO] 	 Killing All external provers ... 
11.99/3.95	% Time passed: 3411ms (effective reasoning time: 2772ms)
11.99/3.95	% Solved by strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>
11.99/3.95	% Axioms used in derivation (0): 
11.99/3.95	% No. of inferences in proof: 88
11.99/3.95	% SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 3411 ms resp. 2772 ms w/o parsing
11.99/4.00	% SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
11.99/4.00	thf(cONE_decl, type, cONE: (($i > $o) > $o)).
11.99/4.00	thf(cSUCC_decl, type, cSUCC: ((($i > $o) > $o) > (($i > $o) > $o))).
11.99/4.00	thf(cZERO_decl, type, cZERO: (($i > $o) > $o)).
11.99/4.00	thf(sk1_decl, type, sk1: (($i > $i) > (($i > $i) > $i))).
11.99/4.00	thf(sk2_decl, type, sk2: ($i > $o)).
11.99/4.00	thf(sk3_decl, type, sk3: ($i > $o)).
11.99/4.00	thf(sk4_decl, type, sk4: $i).
11.99/4.00	thf(sk5_decl, type, sk5: ($i > $i)).
11.99/4.00	thf(sk6_decl, type, sk6: $i).
11.99/4.00	thf(sk7_decl, type, sk7: ($i > $i)).
11.99/4.00	thf(sk8_decl, type, sk8: $i).
11.99/4.00	thf(sk11_decl, type, sk11: $i).
11.99/4.00	thf(sk12_decl, type, sk12: $i).
11.99/4.00	thf(sk13_decl, type, sk13: $i).
11.99/4.00	thf(sk14_decl, type, sk14: $i).
11.99/4.00	thf(cONE_def, definition, cONE = (cSUCC @ cZERO) ).
11.99/4.00	thf(cSUCC_def, definition, cSUCC = (^ [A:(($i > $o) > $o),B:($i > $o)]: ? [C:$i]: ((B @ C) & (A @ (^ [D:$i]: ((D != C) & (B @ D)))))) ).
11.99/4.00	thf(cZERO_def, definition, cZERO = (^ [A:($i > $o)]: ~ (? [B:$i]: (A @ B))) ).
11.99/4.00	thf(sk1_def, definition, sk1 = (^ [A:($i > $i),B:($i > $i)]: (@+ [C:$i]: ~ ((B @ C) = (A @ C)))) ).
11.99/4.00	thf(sk5_def, definition, sk5 = (^ [A:$i]: (@+ [B:$i]: (~ (B = A) & (sk2 @ B)))) ).
11.99/4.00	thf(sk6_def, definition, sk6 = (@+ [A:$i]: ((sk2 @ A) & ~ (? [B:$i]: (~ (B = A) & (sk2 @ B))))) ).
11.99/4.00	thf(sk7_def, definition, sk7 = (^ [A:$i]: (@+ [B:$i]: (sk2 = ((=) @ $i @ B)))) ).
11.99/4.00	thf(sk8_def, definition, sk8 = (@+ [A:$i]: (~ (A = sk4) & (sk3 @ A))) ).
11.99/4.00	thf(sk11_def, definition, sk11 = (@+ [A:$i]: (~ (A = sk4) & (sk3 @ A))) ).
11.99/4.00	thf(sk12_def, definition, sk12 = (@+ [A:$i]: (~ (A = sk4) & (sk3 @ A))) ).
11.99/4.00	thf(1,conjecture,(((cONE = (^ [A:($i > $o)]: ? [B:$i]: (A = ((=) @ $i @ B)))) <= (! [A:($i > $i),B:($i > $i)]: ((! [C:$i]: ((A @ C) = (B @ C))) => (A = B))))),file('/export/starexec/sandbox/benchmark/theBenchmark.p',cX6101_EXT_pme)).
11.99/4.00	thf(2,negated_conjecture,((~ ((cONE = (^ [A:($i > $o)]: ? [B:$i]: (A = ((=) @ $i @ B)))) <= (! [A:($i > $i),B:($i > $i)]: ((! [C:$i]: ((A @ C) = (B @ C))) => (A = B)))))),inference(neg_conjecture,[status(cth)],[1])).
11.99/4.00	thf(3,plain,((~ ((! [A:($i > $i),B:($i > $i)]: ((! [C:$i]: ((A @ C) = (B @ C))) => ((A) = (B)))) => ((^ [A:($i > $o)]: ? [B:$i]: ((A @ B) & ~ (? [C:$i]: (~ (C = B) & (A @ C))))) = (^ [A:($i > $o)]: ? [B:$i]: (A = ((=) @ $i @ B))))))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[2])).
11.99/4.00	thf(4,plain,(! [B:($i > $i),A:($i > $i)] : (((~ ((A @ (sk1 @ (B) @ (A))) = (B @ (sk1 @ (B) @ (A)))) | ((A) = (B))) & ~ ((^ [C:($i > $o)]: ? [D:$i]: ((C @ D) & ~ (? [E:$i]: (~ (E = D) & (C @ E))))) = (^ [C:($i > $o)]: ? [D:$i]: (C = ((=) @ $i @ D))))))),inference(cnf,[status(esa)],[3])).
11.99/4.00	thf(6,plain,((~ ((^ [A:($i > $o)]: ? [B:$i]: ((A @ B) & ~ (? [C:$i]: (~ (C = B) & (A @ C))))) = (^ [A:($i > $o)]: ? [B:$i]: (A = ((=) @ $i @ B)))))),inference(cnfConj,[status(thm)],[4])).
11.99/4.00	thf(8,plain,(((^ [A:($i > $o)]: ? [B:$i]: ((A @ B) & ~ (? [C:$i]: (~ (C = B) & (A @ C))))) != (^ [A:($i > $o)]: ? [B:$i]: (A = ((=) @ $i @ B))))),inference(lifteq,[status(thm)],[6])).
11.99/4.00	thf(9,plain,(((^ [A:($i > $o),B:$i]: ((A @ B) & ~ (? [C:$i]: (~ (C = B) & (A @ C))))) != (^ [A:($i > $o),B:$i]: (A = ((=) @ $i @ B))))),inference(simp,[status(thm)],[8])).
11.99/4.00	thf(11,plain,((((sk3 @ sk4) & ~ (? [A:$i]: (~ (A = sk4) & (sk3 @ A)))) != ((sk3) = ((=) @ $i @ sk4)))),inference(func_ext,[status(esa)],[9])).
11.99/4.00	thf(26,plain,(((sk3 @ sk4) & ~ (? [A:$i]: (~ (A = sk4) & (sk3 @ A)))) | ((sk3) = ((=) @ $i @ sk4))),inference(bool_ext,[status(thm)],[11])).
11.99/4.00	thf(28,plain,(((sk3) = ((=) @ $i @ sk4)) | ((sk3 @ sk4) & ~ (? [A:$i]: (~ (A = sk4) & (sk3 @ A))))),inference(lifteq,[status(thm)],[26])).
11.99/4.00	thf(33,plain,(! [A:$i] : (((((sk3) = ((=) @ $i @ sk4)) | (sk3 @ sk4)) & (((sk3) = ((=) @ $i @ sk4)) | (A = sk4) | ~ (sk3 @ A))))),inference(cnf,[status(esa)],[28])).
11.99/4.00	thf(34,plain,(((sk3) = ((=) @ $i @ sk4)) | (sk3 @ sk4)),inference(cnfConj,[status(thm)],[33])).
11.99/4.00	thf(37,plain,(((sk3) = ((=) @ $i @ sk4)) | (((($true)) & ~ (? [A:$i]: (~ (A = sk4) & (sk3 @ A)))) != ((sk3) = ((=) @ $i @ sk4))) | ((sk3 @ sk4) != (sk3 @ sk4))),inference(paramod_ordered,[status(thm)],[34,11])).
11.99/4.00	thf(38,plain,(((sk3) = ((=) @ $i @ sk4)) | ((~ (? [A:$i]: (~ (A = sk4) & (sk3 @ A)))) != ((sk3) = ((=) @ $i @ sk4))) | ((sk3 @ sk4) != (sk3 @ sk4))),inference(simp,[status(thm)],[37])).
11.99/4.00	thf(39,plain,(((sk3) = ((=) @ $i @ sk4)) | ((~ (? [A:$i]: (~ (A = sk4) & (sk3 @ A)))) != ((sk3) = ((=) @ $i @ sk4)))),inference(pattern_uni,[status(thm)],[38:[]])).
11.99/4.00	thf(64,plain,(! [A:$i] : (((sk3 @ A) = (sk4 = A)) | ((~ (? [B:$i]: (~ (B = sk4) & (sk3 @ B)))) != ((sk3) = ((=) @ $i @ sk4))))),inference(func_ext,[status(esa)],[39])).
11.99/4.00	thf(94,plain,(! [A:$i] : (((~ (? [B:$i]: (~ (B = sk4) & (sk3 @ B)))) != ((sk3) = ((=) @ $i @ sk4))) | (((sk4 = A) & ~ (? [B:$i]: (~ (B = sk4) & (sk3 @ B)))) != ((sk3) = ((=) @ $i @ sk4))) | ((sk3 @ A) != (sk3 @ sk4)))),inference(paramod_ordered,[status(thm)],[64,11])).
11.99/4.00	thf(95,plain,(((~ (? [A:$i]: (~ (A = sk4) & (sk3 @ A)))) != ((sk3) = ((=) @ $i @ sk4))) | (((sk4 = sk4) & ~ (? [A:$i]: (~ (A = sk4) & (sk3 @ A)))) != ((sk3) = ((=) @ $i @ sk4)))),inference(pattern_uni,[status(thm)],[94:[bind(A, $thf(sk4))]])).
11.99/4.00	thf(126,plain,(((~ (? [A:$i]: (~ (A = sk4) & (sk3 @ A)))) != ((sk3) = ((=) @ $i @ sk4)))),inference(simp,[status(thm)],[95])).
11.99/4.00	thf(130,plain,((~ (~ (? [A:$i]: (~ (A = sk4) & (sk3 @ A))))) | (~ ((sk3) = ((=) @ $i @ sk4)))),inference(bool_ext,[status(thm)],[126])).
11.99/4.00	thf(136,plain,(((sk3) != ((=) @ $i @ sk4)) | (~ (~ (? [A:$i]: (~ (A = sk4) & (sk3 @ A)))))),inference(lifteq,[status(thm)],[130])).
11.99/4.00	thf(143,plain,(((~ ((sk3) = ((=) @ $i @ sk4)) | ~ (sk12 = sk4)) & (~ ((sk3) = ((=) @ $i @ sk4)) | (sk3 @ sk12)))),inference(cnf,[status(esa)],[136])).
11.99/4.00	thf(144,plain,(((sk3) != ((=) @ $i @ sk4)) | (~ (sk12 = sk4))),inference(cnfConj,[status(thm)],[143])).
11.99/4.00	thf(146,plain,((sk12 != sk4) | ((sk3) != ((=) @ $i @ sk4))),inference(lifteq,[status(thm)],[144])).
11.99/4.00	thf(162,plain,(((sk3 @ sk13) != (sk4 = sk13)) | (sk12 != sk4)),inference(func_ext,[status(esa)],[146])).
11.99/4.00	thf(167,plain,((sk12 != sk4) | (sk3 @ sk13) | (sk4 = sk13)),inference(bool_ext,[status(thm)],[162])).
11.99/4.00	thf(174,plain,((sk13 = sk4) | (sk12 != sk4) | (sk3 @ sk13)),inference(lifteq,[status(thm)],[167])).
11.99/4.00	thf(163,plain,((sk3 @ sk4) | (sk12 != sk4) | (((=) @ $i @ sk4) != ((=) @ $i @ sk4)) | ((sk3) != (sk3))),inference(paramod_ordered,[status(thm)],[34,146])).
11.99/4.00	thf(164,plain,((sk3 @ sk4) | (sk12 != sk4) | ((sk3) != (sk3))),inference(simp,[status(thm)],[163])).
11.99/4.00	thf(165,plain,((sk3 @ sk4) | (sk12 != sk4)),inference(pattern_uni,[status(thm)],[164:[]])).
11.99/4.00	thf(166,plain,((sk12 != sk4) | (~ (sk3 @ sk13)) | (~ (sk4 = sk13))),inference(bool_ext,[status(thm)],[162])).
11.99/4.00	thf(173,plain,((sk13 != sk4) | (sk12 != sk4) | (~ (sk3 @ sk13))),inference(lifteq,[status(thm)],[166])).
11.99/4.00	thf(259,plain,((sk12 != sk4) | (sk13 != sk4) | (sk12 != sk4) | ~ (($true)) | ((sk3 @ sk13) != (sk3 @ sk4))),inference(paramod_ordered,[status(thm)],[165,173])).
11.99/4.00	thf(260,plain,((sk12 != sk4) | (sk13 != sk4) | ((sk3 @ sk13) != (sk3 @ sk4))),inference(simp,[status(thm)],[259])).
11.99/4.00	thf(267,plain,((sk12 != sk4) | (sk13 != sk4) | (sk13 != sk4)),inference(simp,[status(thm)],[260])).
11.99/4.00	thf(274,plain,((sk12 != sk4) | (sk13 != sk4)),inference(simp,[status(thm)],[267])).
11.99/4.00	thf(287,plain,((sk12 != sk4) | (sk3 @ sk13) | (sk12 != sk4) | (sk4 != sk4) | (sk13 != sk13)),inference(paramod_ordered,[status(thm)],[174,274])).
11.99/4.00	thf(288,plain,((sk12 != sk4) | (sk3 @ sk13) | (sk13 != sk13)),inference(simp,[status(thm)],[287])).
11.99/4.00	thf(289,plain,((sk12 != sk4) | (sk3 @ sk13)),inference(pattern_uni,[status(thm)],[288:[]])).
11.99/4.00	thf(10,plain,(((? [A:$i]: ((sk2 @ A) & ~ (? [B:$i]: (~ (B = A) & (sk2 @ B))))) != (? [A:$i]: ((sk2) = ((=) @ $i @ A))))),inference(func_ext,[status(esa)],[8])).
11.99/4.00	thf(12,plain,(((^ [A:$i]: ((sk2 @ A) & ~ (? [B:$i]: (~ (B = A) & (sk2 @ B))))) != (^ [A:$i]: (sk2 = ((=) @ $i @ A))))),inference(simp,[status(thm)],[10])).
11.99/4.00	thf(25,plain,((~ ((sk3 @ sk4) & ~ (? [A:$i]: (~ (A = sk4) & (sk3 @ A))))) | (~ ((sk3) = ((=) @ $i @ sk4)))),inference(bool_ext,[status(thm)],[11])).
11.99/4.00	thf(27,plain,(((sk3) != ((=) @ $i @ sk4)) | (~ ((sk3 @ sk4) & ~ (? [A:$i]: (~ (A = sk4) & (sk3 @ A)))))),inference(lifteq,[status(thm)],[25])).
11.99/4.00	thf(29,plain,(((~ ((sk3) = ((=) @ $i @ sk4)) | ~ (sk3 @ sk4) | ~ (sk8 = sk4)) & (~ ((sk3) = ((=) @ $i @ sk4)) | ~ (sk3 @ sk4) | (sk3 @ sk8)))),inference(cnf,[status(esa)],[27])).
11.99/4.00	thf(31,plain,(((sk3) != ((=) @ $i @ sk4)) | (~ (sk3 @ sk4)) | (sk3 @ sk8)),inference(cnfConj,[status(thm)],[29])).
11.99/4.00	thf(145,plain,(((sk3) != ((=) @ $i @ sk4)) | (sk3 @ sk12)),inference(cnfConj,[status(thm)],[143])).
11.99/4.00	thf(216,plain,((sk3 @ sk4) | (((=) @ $i @ sk4) != ((=) @ $i @ sk4)) | (sk3 @ sk12) | ((sk3) != (sk3))),inference(paramod_ordered,[status(thm)],[34,145])).
11.99/4.00	thf(217,plain,((sk3 @ sk4) | (sk3 @ sk12) | ((sk3) != (sk3))),inference(simp,[status(thm)],[216])).
11.99/4.00	thf(218,plain,((sk3 @ sk4) | (sk3 @ sk12)),inference(pattern_uni,[status(thm)],[217:[]])).
11.99/4.00	thf(209,plain,(((sk3 @ sk14) != (sk4 = sk14)) | (sk3 @ sk12)),inference(func_ext,[status(esa)],[145])).
11.99/4.00	thf(350,plain,((sk3 @ sk12) | (sk3 @ sk14) | (sk4 = sk14)),inference(bool_ext,[status(thm)],[209])).
11.99/4.00	thf(364,plain,((sk14 = sk4) | (sk3 @ sk12) | (sk3 @ sk14)),inference(lifteq,[status(thm)],[350])).
11.99/4.00	thf(133,plain,((sk3 @ sk4) | ((~ (? [A:$i]: (~ (A = sk4) & (sk3 @ A)))) != (((=) @ $i @ sk4) = ((=) @ $i @ sk4))) | ((sk3) != (sk3))),inference(paramod_ordered,[status(thm)],[34,126])).
11.99/4.00	thf(134,plain,((sk3 @ sk4) | (? [A:$i]: (~ (A = sk4) & (sk3 @ A))) | ((sk3) != (sk3))),inference(simp,[status(thm)],[133])).
11.99/4.00	thf(135,plain,((sk3 @ sk4) | (? [A:$i]: (~ (A = sk4) & (sk3 @ A)))),inference(pattern_uni,[status(thm)],[134:[]])).
11.99/4.00	thf(139,plain,((((sk3 @ sk4) | ~ (sk11 = sk4)) & ((sk3 @ sk4) | (sk3 @ sk11)))),inference(cnf,[status(esa)],[135])).
11.99/4.00	thf(140,plain,((sk3 @ sk4) | (~ (sk11 = sk4))),inference(cnfConj,[status(thm)],[139])).
11.99/4.00	thf(142,plain,((sk11 != sk4) | (sk3 @ sk4)),inference(lifteq,[status(thm)],[140])).
11.99/4.00	thf(30,plain,(((sk3) != ((=) @ $i @ sk4)) | (~ (sk3 @ sk4)) | (~ (sk8 = sk4))),inference(cnfConj,[status(thm)],[29])).
11.99/4.00	thf(32,plain,((sk8 != sk4) | ((sk3) != ((=) @ $i @ sk4)) | (~ (sk3 @ sk4))),inference(lifteq,[status(thm)],[30])).
11.99/4.00	thf(183,plain,((sk11 != sk4) | (sk8 != sk4) | ((sk3) != ((=) @ $i @ sk4)) | ~ (($true)) | ((sk3 @ sk4) != (sk3 @ sk4))),inference(paramod_ordered,[status(thm)],[142,32])).
11.99/4.00	thf(184,plain,((sk11 != sk4) | (sk8 != sk4) | ((sk3) != ((=) @ $i @ sk4)) | ((sk3 @ sk4) != (sk3 @ sk4))),inference(simp,[status(thm)],[183])).
11.99/4.00	thf(185,plain,((sk11 != sk4) | (sk8 != sk4) | ((sk3) != ((=) @ $i @ sk4))),inference(pattern_uni,[status(thm)],[184:[]])).
11.99/4.00	thf(14,plain,((? [A:$i]: ((sk2 @ A) & ~ (? [B:$i]: (~ (B = A) & (sk2 @ B))))) | (? [A:$i]: ((sk2) = ((=) @ $i @ A)))),inference(bool_ext,[status(thm)],[10])).
11.99/4.00	thf(20,plain,(! [A:$i] : ((((sk2 @ sk6) | ((sk2) = ((=) @ $i @ (sk7 @ A)))) & ((A = sk6) | ~ (sk2 @ A) | ((sk2) = ((=) @ $i @ (sk7 @ A))))))),inference(cnf,[status(esa)],[14])).
11.99/4.00	thf(22,plain,(! [A:$i] : ((A = sk6) | (~ (sk2 @ A)) | ((sk2) = ((=) @ $i @ (sk7 @ A))))),inference(cnfConj,[status(thm)],[20])).
11.99/4.00	thf(24,plain,(! [A:$i] : ((A = sk6) | ((sk2) = ((=) @ $i @ (sk7 @ A))) | (~ (sk2 @ A)))),inference(lifteq,[status(thm)],[22])).
11.99/4.00	thf(141,plain,((sk3 @ sk4) | (sk3 @ sk11)),inference(cnfConj,[status(thm)],[139])).
11.99/4.00	thf(156,plain,((sk3 @ sk4) | ((sk3 @ sk11) != (sk3 @ sk4)) | ~ (($true))),inference(eqfactor_ordered,[status(thm)],[141])).
11.99/4.00	thf(160,plain,((sk3 @ sk4) | ((sk3 @ sk11) != (sk3 @ sk4))),inference(simp,[status(thm)],[156])).
11.99/4.00	thf(349,plain,((sk3 @ sk12) | (~ (sk3 @ sk14)) | (~ (sk4 = sk14))),inference(bool_ext,[status(thm)],[209])).
11.99/4.00	thf(362,plain,((sk14 != sk4) | (sk3 @ sk12) | (~ (sk3 @ sk14))),inference(lifteq,[status(thm)],[349])).
11.99/4.00	thf(5,plain,(! [B:($i > $i),A:($i > $i)] : ((~ ((A @ (sk1 @ (B) @ (A))) = (B @ (sk1 @ (B) @ (A))))) | ((A) = (B)))),inference(cnfConj,[status(thm)],[4])).
11.99/4.00	thf(7,plain,(! [B:($i > $i),A:($i > $i)] : (((A @ (sk1 @ (B) @ (A))) != (B @ (sk1 @ (B) @ (A)))) | ((A) = (B)))),inference(lifteq,[status(thm)],[5])).
11.99/4.00	thf(63,plain,(! [C:$i,B:($i > $i),A:($i > $i)] : (((A @ C) = (B @ C)) | ((A @ (sk1 @ (B) @ (A))) != (B @ (sk1 @ (B) @ (A)))))),inference(func_ext,[status(esa)],[7])).
11.99/4.00	thf(13,plain,((~ (? [A:$i]: ((sk2 @ A) & ~ (? [B:$i]: (~ (B = A) & (sk2 @ B)))))) | (~ (? [A:$i]: ((sk2) = ((=) @ $i @ A))))),inference(bool_ext,[status(thm)],[10])).
11.99/4.00	thf(15,plain,(! [B:$i,A:$i] : (((~ (sk2 @ A) | ~ ((sk5 @ A) = A) | ~ ((sk2) = ((=) @ $i @ B))) & (~ (sk2 @ A) | (sk2 @ (sk5 @ A)) | ~ ((sk2) = ((=) @ $i @ B)))))),inference(cnf,[status(esa)],[13])).
11.99/4.00	thf(16,plain,(! [B:$i,A:$i] : ((~ (sk2 @ A)) | (~ ((sk5 @ A) = A)) | (~ ((sk2) = ((=) @ $i @ B))))),inference(cnfConj,[status(thm)],[15])).
11.99/4.00	thf(18,plain,(! [B:$i,A:$i] : (((sk5 @ A) != A) | ((sk2) != ((=) @ $i @ B)) | (~ (sk2 @ A)))),inference(lifteq,[status(thm)],[16])).
11.99/4.00	thf(391,plain,(! [C:$i,B:($i > $i),A:($i > $i)] : (((A @ (sk1 @ (B) @ (A))) != (B @ (sk1 @ (B) @ (A)))) | (((sk3) = ((=) @ $i @ (A @ C))) != (~ (? [D:$i]: (~ (D = sk4) & (sk3 @ D))))) | ((B @ C) != sk4))),inference(paramod_ordered,[status(thm)],[63,126])).
11.99/4.00	thf(517,plain,(! [A:($i > $i)] : (((A @ (sk1 @ (^ [B:$i]: (B)) @ (A))) != (sk1 @ (^ [B:$i]: (B)) @ (A))) | (((sk3) = ((=) @ $i @ (A @ sk4))) != (~ (? [B:$i]: (~ (B = sk4) & (sk3 @ B))))))),inference(pre_uni,[status(thm)],[391:[bind(A, $thf(A)),bind(B, $thf(^ [D:$i]: (D))),bind(C, $thf(sk4))]])).
11.99/4.00	thf(21,plain,(! [A:$i] : ((sk2 @ sk6) | ((sk2) = ((=) @ $i @ (sk7 @ A))))),inference(cnfConj,[status(thm)],[20])).
11.99/4.00	thf(23,plain,(! [A:$i] : (((sk2) = ((=) @ $i @ (sk7 @ A))) | (sk2 @ sk6))),inference(lifteq,[status(thm)],[21])).
11.99/4.00	thf(231,plain,((sk3 @ sk4) | ((sk3 @ sk12) != (sk3 @ sk4)) | ~ (($true))),inference(eqfactor_ordered,[status(thm)],[218])).
11.99/4.00	thf(235,plain,((sk3 @ sk4) | ((sk3 @ sk12) != (sk3 @ sk4))),inference(simp,[status(thm)],[231])).
11.99/4.00	thf(17,plain,(! [B:$i,A:$i] : ((~ (sk2 @ A)) | (sk2 @ (sk5 @ A)) | (~ ((sk2) = ((=) @ $i @ B))))),inference(cnfConj,[status(thm)],[15])).
11.99/4.00	thf(19,plain,(! [B:$i,A:$i] : (((sk2) != ((=) @ $i @ B)) | (~ (sk2 @ A)) | (sk2 @ (sk5 @ A)))),inference(lifteq,[status(thm)],[17])).
11.99/4.00	thf(1198,plain,(($false)),inference(e,[status(thm)],[289,12,3,31,11,218,126,364,10,142,185,24,160,165,9,141,32,34,274,362,7,162,209,145,63,18,517,23,8,235,146,19])).
11.99/4.00	% SZS output end Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
11.99/4.00	% [INFO] 	 Killing All external provers ... 
12.63/4.12	EOF